A numerically efficient variational algorithm to solve a fractional nonlinear elastic string equation

Numerical Algorithms - In this work, we propose a fractional extension of the one-dimensional nonlinear vibration problem on an elastic string. The fractional problem is governed by a hyperbolic...     

On Sizes of 1-Cross Intersecting Set Pair Systems

Siberian Mathematical Journal - Let $ \{(A_{i},B_{i})\}_{i=1}^{m} $ be a set pair system. Füredi, Gyárfás, and Király called it $ 1 $ -cross intersecting if $...     

High-fidelity Recognition of Organotrifluoroborate Anions (R−BF3−) as Designer Guest Molecules

The recognition of boron compounds is well developed as boronic acids but untapped as organotrifluoroborate anions (R−BF₃⁻). We are exploring the development of these and other designer anions as anion-recognition motifs by considering them as substituted versions of the parent inorganic ion. To this end, we demonstrate strong and reliable binding of organic trifluoroborates, R−BF₃⁻, by cyanostar macrocycles that are size-complementary to the inorganic BF₄⁻ progenitors. We find that recognition is modulated by the substituent's sterics and that the affinities are retained using the common K⁺ salts of R−BF₃⁻ anions.     

On the Standard Conjecture for Compactifications of Néron Models of Three-Dimensional Abelian Varieties with Multiplications in an Imaginary Quadratic Field

Mathematical Notes -     

The Integrative Approach to Study of the Structure and Functions of Cardiac Voltage-Dependent Ion Channels

Crystallography Reports - Membrane proteins, including ion channels, became the focus of structural proteomics midway through the 20th century. Methods for studying ion channels are diverse and...     

Structural Specific Features of Solid Solutions NdxGd1 – xCr3(BO3)4

Optics and Spectroscopy - Optical investigations of crystals of solid solutions NdxGd1 – xCr3(BO3)4, 0.01 ≤ x ≤ 1, have been performed. Absorption spectra in the...     

Prospects for Solving the Muon Puzzle on the NEVOD-DECOR-TREK Complex

Physics of Atomic Nuclei - The muon puzzle is an excess of muon bundles generated by primary cosmic rays (PCR) at energies above 10 $${}^{17}$$ eV compared to estimations that assume even a heavy...     

Some Properties of Lattice Ordered Rings

Mathematical Notes -     

Estimation of the Sorption Activity of Silver Nanoparticles on Biodegradable Fibers of Natural and Artificial Origin

Russian Physics Journal - The specific features of the sorption activity of silver nanoparticles (AgNPs) on biodegradable polymers of natural (collagen) and artificial (polyamide 6.6) origin have...     

Formal proofs of operator identities by a single formal computation

A formal computation proving a new operator identity from known ones is, in principle, restricted by domains and codomains of linear operators involved, since not any two operators can be added or composed. Algebraically, identities can be modelled by noncommutative polynomials and such a formal computation proves that the polynomial corresponding to the new identity lies in the ideal generated by the polynomials corresponding to the known identities. In order to prove an operator identity, however, just proving membership of the polynomial in the ideal is not enough, since the ring of noncommutative polynomials ignores domains and codomains. We show that it suffices to additionally verify compatibility of this polynomial and of the generators of the ideal with the labelled quiver that encodes which polynomials can be realized as linear operators. Then, for every consistent representation of such a quiver in a linear category, there exists a computation in the category that proves the corresponding instance of the identity. Moreover, by assigning the same label to several edges of the quiver, the algebraic framework developed allows to model different versions of an operator by the same indeterminate in the noncommutative polynomials.